Reduction of ILP Search Space with Bottom-Up Propositionalisation
نویسندگان
چکیده
This paper introduces a method for algorithmic reduction of the search space of an ILP task, omitting the need for explicit language bias. It relies on bottom-up propositionalisation of examples and background knowledge. A proof of concept has been developed for observational learning of stratified normal logic programs.
منابع مشابه
Inductive Logic Programming as Abductive Search
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems based on Inverse Entailment and is the first top-down ILP system that allows background theories and hypotheses to be normal logic programs. The approach relies on mapping an ILP problem into an equivalent ALP one. T...
متن کاملApproaching the ILP 2005 Challenge: Class-Conditional Bayesian Propositionalization for Genetic Classification
This report presents a statistical propositionalisation approach to relational classification and probability estimation on the genetic ILP Challenge domain. The main difference between our and existing propositionalisation approaches is its ability to construct features from categorical attributes with many possible values and in particular the object identifiers. Our classification and rankin...
متن کاملEfficient learning and evaluation of complex concepts in inductive logic programming
Inductive Logic Programming (ILP) is a subfield of Machine Learning with foundations in logic programming. In ILP, logic programming, a subset of first-order logic, is used as a uniform representation language for the problem specification and induced theories. ILP has been successfully applied to many real-world problems, especially in the biological domain (e.g. drug design, protein structure...
متن کاملREDA-ILP: Learning Theories using EDA and Reduced Bottom Clauses
In our previous work we have introduced EDA-ILP, an Inductive Logic Programming (ILP) system based on Estimation Distribution Algorithm (EDA). EDA-ILP showed to be superior when compared to GA-ILP, a variation of EDA-ILP created replacing the EDA by a “conventional” Genetic Algorithm. Additionally, EDA-ILP proved to be very competitive when compared to the state of the art ILP system Aleph. Thi...
متن کاملLazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL learning problem into an attribute-value one and then applying efficient learning techniques dedicated to this simpler formalism. The complexity of such propositionalisation methods is now in the size of the reformulated pro...
متن کامل